منابع مشابه
Representing Simplicial Complexes with Mangroves
Simplicial complexes are extensively used for discretizing digital shapes in two, three, and higher dimensions within a variety of application domains. There have been many proposals of topological data structures, which represent the connectivity information among simplices. We introduce the Mangrove Topological Data Structure (Mangrove TDS) framework, a tool which supports the efficient imple...
متن کاملRIGID DUALIZING COMPLEXES
Let $X$ be a sufficiently nice scheme. We survey some recent progress on dualizing complexes. It turns out that a complex in $kinj X$ is dualizing if and only if tensor product with it induces an equivalence of categories from Murfet's new category $kmpr X$ to the category $kinj X$. In these terms, it becomes interesting to wonder how to glue such equivalences.
متن کاملNew methods for constructing shellable simplicial complexes
A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$. If $mathbb{K}$ is a field, then there is a one-to-one correspondence between clutters on $V$ and square-free monomial ideals in $mathbb{K}[x_1,ldots,x_n]$ as follows: To each clutter $mathcal{C}...
متن کاملSimplicial Complexes with Lattice Structures
If L is a finite lattice, we show that there is a natural topological lattice structure on the geometric realization of its order complex ∆(L) (definition recalled below). Lattice-theoretically, the resulting object is a subdirect product of copies of L. We note properties of this construction and of some variants, and pose several questions. For M3 the 5-element nondistributive modular lattice...
متن کاملApproximating the Simplicial Depth
Let P be a set of n points in d-dimensions. The simplicial depth, σP (q) of a point q is the number of d-simplices with vertices in P that contain q in their convex hulls. The simplicial depth is a notion of data depth with many applications in robust statistics and computational geometry. Computing the simplicial depth of a point is known to be a challenging problem. The trivial solution requi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archiv der Mathematik
سال: 2012
ISSN: 0003-889X,1420-8938
DOI: 10.1007/s00013-012-0421-z